Optimized Triangle Mesh Compression using Prediction Trees
نویسندگان
چکیده
Recently, a wealth of algorithms for the efficient coding of 3D triangle meshes have been published (e.g. [1,2,4,5,6,7,8]). All these focus on achieving the most compact code for the connectivity data, resulting in between 0.7 and 2 bits per triangle on the average. The geometric data, i.e. the vertex coordinates, are then coded in an order induced by the connectivity code, which is probably not optimal. This is a pity, as the geometric portion of the dataset dominates the code.
منابع مشابه
Optimized Compression of Triangle Mesh Geometry Using Prediction Trees
Almost all triangle mesh compression algorithms to date are driven by the mesh connectivity code. The geometry code usually employs a straightforward prediction method applied to the vertex sequence as dictated by the connectivity code. This generates a suboptimal geometry code, which results in significant loss in code efficiency, since the geometry dominates the mesh information content. This...
متن کاملDelphi Encoding: Improving Edgebreaker 3D Compression by Geometry based Connectivity Prediction
Delphi is a new geometry-guided predictive compression scheme for squeezing the connectivity of a triangluar mesh. The mesh is traversed using the Edgebreaker state machine. Instead of creating the Edgebreaker clers sequence both compression and decompression perform the same geometric prediction of the location of the unknown vertex of the next triangle during the mesh traversal. Based on this...
متن کاملA Parallel Approach to Compression and Decompression of Triangle Meshes using the GPU
Most state-of-the-art compression algorithms use complex connectivity traversal and prediction schemes, which are not efficient enough for online compression of large meshes. In this paper we propose a scalable massively parallel approach for compression and decompression of large triangle meshes using the GPU. Our method traverses the input mesh in a parallel breadth-first manner and encodes t...
متن کاملTriangle Mesh Compression for Fast Rendering
Modern GIS(Geographic Information System) application programs and simulation systems have to handle large datasets for rendering. Currently three dimensional rendering hardware are facing a memory bus bandwidth bottleneck problem at the graphics pipeline. One general solution for this problem is to compress the static three dimensional geometry in a preprocessing phase. We present a new mesh c...
متن کاملCS448B Critique: Geometric Compression Through Topological Surgery
This paper details a geometric compression technique for triangulated 3D polyhedral models which significantly reduces their storage and transmission costs. The method is based on entropy and run-length encoding of vertex and triangle spanning trees. This losslessly compresses mesh connectivity to less than two bits per triangle on average. Vertex positions and properties are quantized and enco...
متن کامل